Congested Link Inference Algorithms in Dynamic Routing IP Network

Survivable composite-link IP network design with OSPF routing

OSPF, or Open Shortest Path First, is a commonly used interior gateway protocol. An integer weight is assigned to each arc and the entire network topology and arc weights are known to each router. Each router computes a graph of shortest weight paths from itself to every other router in the network. Traffic is routed on the shortest weight paths. All traffic leaving router s with destination ro...

12. IP Routing Algorithms

IP Routing Lookups Algorithms Evaluation

We consider the problem of organizing the Internet routing tables in such a way as to enable fast routing lookup performance We concentrate on two recently proposed methods and try to evaluate their performance We describe our implementation of the methods and results of performance measurements on existing as well as arti cially generated input data We present some conclusions about the genera...

Collectively optimal routing for congested traffic limited by link capacity.

We show that the capacity of a complex network that models a city street grid to support congested traffic can be optimized by using routes that collectively minimize the maximum ratio of betweenness to capacity in any link. Networks with a heterogeneous distribution of link capacities and with a heterogeneous transport load are considered. We find that overall traffic congestion and average tr...

Static and Dynamic Low-Congested Interval Routing Schemes

Interval Routing Schemes (IRS for short) have been extensively investigated in the past years with special emphasis on shortest paths. Besides their theoretical interest, IRS have practical applications, as they have been implemented with wormhole routing in the last generation of INMOS Transputer Router Chips. In this paper we consider IRS that are optimal with respect to the congestion of the...